Step of Proof: mul_preserves_lt
12,41
postcript
pdf
Inference at
*
1
1
I
of proof for Lemma
mul
preserves
lt
:
.....basecase..... NILNIL
1.
a
:
2.
b
:
3.
a
<
b
4.
n
:
5. 0 <
n
6. 1 =
n
(
n
*
a
) < (
n
*
b
)
latex
by ((RevHypSubst 6 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 2:n),(first_nat 3:n
C
)) (first_tok :t) inil_term)))
latex
C
.
Definitions
,
t
T
origin